Bit Indexed Explicit Forwarding Optimization

ABSTRACT

Disclosed is the generation of a bit-indexed forwarding table (BIFT) that can include a plurality of entries, each such entry corresponding to a bit position of a plurality of bit positions, where each such bit position represents an egress network node of a plurality of egress network nodes, and the generating configures the BIFT to be used in forwarding a packet to one or more of the plurality of egress network nodes, based at least in part on a bit string in the packet. The generating includes selecting a bit position of the plurality of bit positions as a selected bit position, creating an entry of the plurality of entries (where the entry corresponds to the selected bit position), identifying a neighbor node associated with the selected bit position, and updating one or more fields of the entry with neighbor information regarding the neighbor node.

RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 16/525,649, entitled “Bit Indexed Explicit Replication Forwarding Optimization,” filed Jul. 30, 2019, which is a continuation of U.S. application Ser. No. 15/658,110, entitled “Bit Indexed Explicit Replication Forwarding Optimization,” filed Jul. 24, 2017, which is a continuation of U.S. application Ser. No. 14/603,580, entitled “Bit Mask Forwarding Replication Optimization,” filed Jan. 23, 2015, which claims the domestic benefit under Title 35 of the United States Code § 119(e) of U.S. Provisional Patent Application Ser. No. 61/931,473, entitled “Bit Mask Forwarding Architectures for Stateless Multipoint Replication,” filed Jan. 24, 2014, which is hereby incorporated by reference in its entirety and for all purposes as if completely and fully set forth herein.

U.S. application Ser. No. 14/603,580, entitled “Bit Mask Forwarding Replication Optimization,” filed Jan. 23, 2015, is also a continuation-in-part of U.S. application Ser. No. 14/488,790, entitled “Bit Indexed Explicit Replication Using Multiprotocol Label Switching,” filed Sep. 17, 2014, which in turn claims the domestic benefit under Title 35 of the United States Code § 119(e) of U.S. Provisional Patent Application Nos. 61/878,693, entitled “Multicast IPv6 with Bit Mask Forwarding,” filed Sep. 17, 2013, and 61/931,473, entitled “Bit Mask Forwarding Architectures for Stateless Multipoint Replication,” filed Jan. 24, 2014. U.S. application Ser. No. 14/603,580, entitled “Bit Mask Forwarding Replication Optimization,” filed Jan. 23, 2015, is also a continuation-in-part of U.S. application Ser. No. 14/488,761, entitled “Bit Indexed Explicit Replication,” filed Sep. 17, 2014, which in turn claims the domestic benefit under Title 35 of the United States Code § 119(e) of U.S. Provisional Patent Application Nos. 61/878,693, entitled “Multicast IPv6 with Bit Mask Forwarding,” filed Sep. 17, 2013, and 61/931,473, entitled “Bit Mask Forwarding Architectures for Stateless Multipoint Replication,” filed Jan. 24, 2014. U.S. application Ser. No. 14/603,580, entitled “Bit Mask Forwarding Replication Optimization,” filed Jan. 23, 2015, is also a continuation-in-part of U.S. application Ser. No. 14/488,810, entitled “Bit Indexed Explicit Replication Using Internet Protocol Version 6,” filed Sep. 17, 2014, which in turn claims the domestic benefit under Title 35 of the United States Code § 119(e) of U.S. Provisional Patent Application Nos. 61/878,693, entitled “Multicast IPv6 with Bit Mask Forwarding,” filed Sep. 17, 2013, and 61/931,473, entitled “Bit Mask Forwarding Architectures for Stateless Multipoint Replication,” filed Jan. 24, 2014. Each of the two provisional and four non-provisional applications referenced above is hereby incorporated by reference in their entirety and for all purposes as if completely and fully set forth herein.

BACKGROUND OF THE INVENTION

Network nodes forward data. Network nodes may take form in one or more routers, one or more bridges, one or more switches, one or more servers, or any other suitable communications processing device. The data is commonly formatted as packets and forwarded using forwarding tables. A packet is a formatted unit of data that typically contains control information and payload data. Control information may include: information that identifies sources and destinations, such as addresses, error detection codes like checksums, sequencing information, etc. Control information is typically found in packet headers and trailers. Payload data is typically located between the packet headers and trailers.

Forwarding packets involves various processes that, while simple in concept, can be complex. The processes involved in forwarding packets vary, depending on the type of forwarding method used. In many networks, multicast is the preferred method of data forwarding. One reason for this is that multicast is a bandwidth-conserving technology that reduces traffic by simultaneously delivering data to multiple receivers. However, in traditional multicast systems, a relatively large amount of control plane information is used. Setting up and maintaining this control information has a tendency to become complex and costly in terms of computing resources, and can become a major limiting factor in overall network performance. Another issue with multicast is that due to packet delivery mechanisms used, packets are sometimes forwarded to locations where the packets were not desired. This unnecessary delivery of packets represents an unwelcome burden on network performance. Overcoming this burden by traditional means involves generation and maintenance of even more control plane information.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure may be better understood, and its numerous objects, features, and advantages made apparent to those skilled in the art by referencing the accompanying drawings.

FIG. 1 is a simplified block diagram illustrating certain components of an example network.

FIG. 2 is a simplified block diagram illustrating certain components of an example network.

FIG. 3A is a flow chart illustrating an example process employed by a node, according to the present description.

FIG. 3B is a flow chart illustrating an example process employed by a node, according to the present description.

FIG. 4 is a simplified block diagram illustrating certain components of an example network.

FIG. 5A is an example table generated by node, according to the present description.

FIG. 5B is an example table generated by node, according to the present description.

FIG. 5C is an example table generated by node, according to the present description.

FIG. 6 is a flow chart illustrating an example process employed by a node, according to the present description.

FIG. 7 is a flow chart illustrating an example process employed by a node, according to the present description.

FIG. 8A is a flow chart illustrating an example process employed by a node, according to the present description.

FIG. 8B is a flow chart illustrating an example process employed by a node, according to the present description.

FIG. 9 is a flow chart illustrating an example process employed by a node, according to the present description.

FIG. 10 is a block diagram illustrating certain components of an example node that can be employed, according to the present description.

FIG. 11 is a block diagram depicting a computer system suitable for implementing embodiments of the systems described herein.

FIG. 12 is a block diagram depicting a network device suitable for implementing embodiments of the systems described herein.

DETAILED DESCRIPTION Overview

Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a packet at a node. The packet includes a bit string. The node traverses the bit string and selects an entry in a bit indexed forwarding table (BIFT). The entry includes a forwarding bit mask. Based on the forwarding bit mask and the bit string, the node forwards the packet.

Multicast

Multicast delivers multicast data packets (data packets that traditionally include information identifying a multicast group, such as a multicast group address) from a source to multiple receivers without unduly burdening the source. As used herein, the term “receiver” signifies a host (such as a computing device or application) that subscribes to a multicast group. Instead of the source replicating a multicast data packet and sending a copy of the multicast data packet to each receiver, the source sends a single copy of a multicast data packet and multicast-enabled routers (referred to herein simply as nodes) replicate the packet at the point(s) where paths to various receivers diverge. Multicast routing protocols enable multicast transmission (i.e., one-to-many connections and many-to-many connections) by replicating a multicast data packet close to the destination of that multicast data packet, obviating the use of multiple unicast connections for the same purpose. This saves network bandwidth and improves throughput.

FIG. 1 is a simplified block diagram of a network 100 performing multicast data transmission. Multicast-enabled nodes 110, 120, 130 and 140 are coupled through network links 150, 160, and 170. Multicast-enabled node 110 is also coupled to source 111 and receiver 112; multicast-enabled node 120 is coupled to receiver 121; multicast-enabled node 130 is coupled to receiver 131 and receiver 132; and multicast-enabled node 140 is coupled to receiver 141. Such coupling between the multicast-enabled nodes and the sources and/or receivers can be direct or indirect (e.g., via a L2 network device or another node).

For the purposes of this illustration, source 111 is a host configured to transmit multicast data packets to a multicast group that includes as receivers hosts 112, 121, 131, 132 and 141. Source 111 transmits a multicast flow, consisting of one or more multicast data packets having a common multicast group address, to multicast-enabled node 110 (illustrated by the arrow from 111 to 110). Multicast-enabled node 110 includes a multicast forwarding table that multicast-enabled node 110 uses to determine where to forward the multicast data packets associated with the multicast flow. The multicast forwarding table includes information identifying each interface of multicast-enabled node 110 that is connected to a multicast distribution tree (MDT) to one or more receivers for the multicast group (e.g., a host that has sent a join message, as described above). Multicast-enabled node 110 then replicates multicast data packets in the multicast flow and transmits the replicated multicast data packets from the identified interfaces to receiver 112, multicast-enabled node 120, and multicast-enabled node 130.

Multicast-enabled nodes 120 and 130 inform node 110 that they are coupled to one or more receivers using join messages, for example, a protocol independent multicast (PIM) join message. In response to receiving the join messages, multicast-enabled node 110 updates its multicast forwarding tables to identify interfaces to which multicast data packets should be forwarded. The multicast data packets can be replicated by node 110 as needed in order to provide the multicast data packets to receivers for the multicast group (e.g., receivers 131 and 132) and other multicast-enabled nodes on the MDT (e.g., multicast-enabled node 140). In this manner, a multicast flow from source 111 can be transmitted through a multicast network to multiple receivers.

As can be seen, the process traditionally used in multicast of setting up MDTs and updating multicast forwarding tables for each group results in considerable amounts of state information within the network. The multicast forwarding tables maintained by each multicast-enabled node, in particular, can become quite large. Maintaining such multicast forwarding tables represents limitations on network scalability.

Bit Indexed Explicit Replication

As described below, techniques are used to attach receiver information to packets in the form of bits and forward the packets based on the receiver information. This greatly reduces the amount of state information stored at nodes and is therefore also referred to as “stateless multicast.” More formally, the term Bit Indexed Explicit Replication (BIER) is used to describe these techniques. As suggested by the term, a bit position is used as an index into a forwarding table and packets are replicated only to specified nodes. BIER enables packets to be forwarded from a source to multiple receivers without the use of multicast distribution trees and per-group state information at each node between the source and receivers.

FIG. 2 shows an example network 200. Network 200 includes BIER-enabled nodes 206-218. BIER-enabled nodes are configured to forward packets using BIER, and are referred to as bit forwarding routers (BFRs). BFRs 206-218 form a provider network, or domain. Such a provider network could be employed by an Internet service provider to transport packets to customers. The domain includes transit nodes 208 and 210, and provider edge nodes 206, 214, 216, and 218. The provider edge nodes are coupled to customer edge nodes 211, 213, 215, and 217. Hosts 201, 203, 205, and 207 are computing devices coupled to the customer edge nodes.

Each of the BFRs 206-218 has interfaces that are identified as shown. For example, BFR 208 has three interfaces designated 1-3, respectively. Each BFR is assigned a unique identifier or routable address known as a router identifier (RID). The RID can be implemented as, for example, an internet protocol (IP) address, a prefix, or a loopback address. Each BFR advertises or floods the routable address to all other BFRs in network 200. Each BFR builds a unicast topology of the BFRs in network 200 using the advertised routable addresses. In one embodiment, the router identifier can be mathematically converted to the set identifier and bit position assigned to a BFR. The conversion depends on the length of bit string being used. For example, to convert a router identifier ‘N’ to a set identifier and bit position, the set identifier is the integer part of the quotient (N-1)/BitStringLength. The bit position is ((N-1) modulo BitStringLength)+1. If, in the above example, N equals 257 and the BitStringLength is 256, the SI is 1 and the BP is 1. BIER network 200 also includes a node configured to operate as a multicast data controller (MDC) 230. The MDC performs configuration and administrative tasks, as described below.

BFR 206 is configured as a bit forwarding ingress router (BFIR) for multicast data packets. BFR 206 is coupled, via customer edge node 211, to source 201. Multicast data packets from source 201 enter the BIER network via the BFIR (BFR 206). Each of BFRs 214, 216, and 218 is configured as a bit forwarding egress router (BFER). The BFERs can be connected (directly or via customer edge routers) to hosts, such as receivers, or other networks. A BFER is a BFR that is the last BFR on a path between a source and a receiver. The BFER may be a provider edge (PE) node that is coupled to the receiver either directly or indirectly (e.g., through a non-BIER-enabled CE node).

Assigning a Bit Position in the Bit String

Each BFER in a BIER network is assigned a bit position (BP) from a set or array of bits. The array of bits can be carried in a packet or other network message. The array of bits can also be stored in forwarding and/or routing tables. For the sake of clarity, the terms used herein are “bit string” (when the array of bits is in a packet) and “bit mask” (when the array of bits is stored in a table). Also, it is noted that BFIRs can act as BFERs and vice versa. BFIRs are also assigned bit positions.

The bit string (or bit mask) can have a fixed or variable length. The length of the bit string used in the BIER network can be statically configured or dynamically assigned, and is distributed through the BIER network. In one embodiment, the length of the bit string is between 256 and 1024 bits, though shorter or longer bit strings can be used. The maximum length of the bit string value is determined, in one embodiment, by hardware or software limitations of the BFRs in the BIER network. In one embodiment, different BFRs in the BIER network use different lengths for their respective bit strings. For example, one BFR may have a maximum bit string length of 128 bits while another BFR may have a maximum bit string length of 256 bits. A bit string is one type of multicast forwarding entry in which each bit position of multiple bit positions is an element that can be used to represent an individual node or interface. Other types of multicast forwarding entries with other types of elements can be used.

A bit position (BP) is statically or dynamically assigned to each BFER. Each BEER should have at least one unique bit position from the bit string. In one embodiment, a central authority, such as a multicast domain controller, will assign the BPs to the BFERs. The multicast domain controller, in one embodiment, assigns multiple BPs to a single BFER, e.g., a unique BP for each of one or more interfaces included in the BFER. Other mechanisms for assigning BPs can be implemented as well, such as deriving a BP from a router identifier assigned to a BFR, where the derivation utilizes a mapping algorithm. In some embodiments, a bit position in the bit string is assigned to a single BFER. In other embodiments, a single BP can be assigned to more than one BFER. When multiple BFERs are assigned the same BP, one of the multiple BFERs can assume ownership of the BP at a given time, and ownership can be transferred between the multiple BFERs. Ownership of the BP can be transferred to another one of the multiple BFERs for any of several reasons, such as a failover in response to a node or link failure, or if one of the multiple BFERs otherwise becomes unavailable, in response to changing network conditions, due to time-sharing considerations, and the like. Assigning one BP to multiple BFERs facilitates operation similar to anycast, in which packets are forwarded to one receiver of a group of receivers, where each receiver in the group of receivers uses a common address.

Only the BIER-enabled edge nodes (e.g., BFERs and BFIRs) in a BIER network are assigned a BP. All other BFRs in the network (e.g., transit nodes) don't need a BP to participate in BIER. This helps to reduce the number of bits assigned in a network. As shown in the example of FIG. 2, network 200 utilizes a four bit long bit string. Each of the four BFERs (including BFIR node 206) in network 200 is assigned a BP: node 206 is assigned BP {1000}; node 214 is assigned BP {0001}; node 216 is assigned BP {0100}; and node 218 is assigned BP {0010}.

Sets

The number of BFERs that can be addressed (assigned a BP) is limited by the size of the bit string included in the multicast data packet. If the bit string is four bits long, the number of BFERs that can be addressed is four. The concept of sets allows an increase in the number of BFERs that can be assigned BPs. The set identifier (SI) is, for example, a number between 0 and 255. The SI allows a BP to be unique in the context of a set. For example, each BP can be re-used in each set. In an embodiment with 256 sets and a bit string length of 256 bits, 65536 (256×256) BFERs can be supported. In one embodiment, BFRs in the BIER network generate separate forwarding information for each SI. For example, if two different set identifiers are in use in the BIER network, the BFRs generate two bit indexed forwarding tables (BIFTs), one corresponding to each SI. In response to receiving a multicast data packet having a SI, the BFR uses the SI to select which forwarding information (e.g., BIFT) to use to forward the multicast data packet.

Signaling

When a receiver (e.g., a host, such as host 203 of FIG. 2) wishes to join a multicast group, the receiver sends membership information (e.g., using Internet Group Management Protocol (IGMP)) to the BFER the receiver is coupled to (either directly or indirectly). The membership information identifies the multicast group the host wishes to join and optionally identifies a source associated with the multicast group. In the example of FIG. 2, host 203 can send an IGMP message to CE node 213 and CE node 213 can then forward the IGMP message to BFR 214. In response to receiving a message indicating a receiver wishes to join a multicast group, the BFER signals its interest in the multicast group identified in the message. This involves, in one embodiment, the BFER sending a membership message to any BFIRs in the network, or to a controller, indicating the BFER's interest in the multicast group and including the BFER's BP. In one embodiment, BFERs use border gateway protocol (BGP) to send membership messages.

The BFER can send the membership message to a subset (less than all) or to all of the BFRs on the edge of the BIER network (BFIRs and BFERs) or can flood the signaling message to all nodes in the network. For example, if the network is using source-specific multicast (SSM), the BFER knows the source of the multicast group (e.g., from the IGMP message received from the receiver) and can look up a path to the specified BFIR and send the signaling message to that BFIR only. If SSM is not the type of multicast being used, the BEER can flood the signaling message to all candidate BFIRs. Only BIER-enabled edge nodes parse the message to determine group and BP information, all other nodes can discard the message. Receivers joining and unsubscribing from multicast groups do not create churn or require any changes in the state information (e.g., bit indexed forwarding tables) maintained by the core BFRs, unlike with traditional multicast. Instead, join or unsubscribe messages signal BFIRs to update the bit string associated with a given multicast group. This involves only the BFIRs updating state information (e.g., updating a group membership table associated with the group) and not the core nodes. This represents a significant improvement over traditional multicast, in which multicast distribution trees are set up and torn down throughout the network based on the join and unsubscribe messages.

Each BFIR, such as BFR 206 of FIG. 2, maintains state information that includes an entry for each multicast group for which the BFIR has received a membership message. In one embodiment, the BFIR maintains the state in a group membership table (GMT), as shown at 224 of FIG. 2. In one embodiment, each entry in the GMT includes information identifying the multicast group (such as a multicast group name and/or an address of a source for the multicast group), a list of BPs corresponding to BFERs that have expressed interest (e.g., via a membership message) in the multicast group identified in the group field, and a bit string, which identifies all of the BFERs that have expressed interest in the multicast group (e.g., by having a bit set in the bit position corresponding to each BFER that has expressed interest in the multicast group). In response to receiving a membership message from a BFER indicating that the BFER is interested in a multicast group, the BFIR sets the bit corresponding to the BFER's BP in the bit string that corresponds to the multicast group. The membership message includes, in one embodiment, the BFER's BP.

Alternatively, the BFIR performs a lookup to determine the BP associated with the BFER that originated the membership message using the address of the BFER that originated the membership message and the information advertised via IGP, e.g., information in the BFIR's BIRT. When the BFER is no longer interested in receiving multicast data packets for the multicast group, the BFER signals to the BFIR, e.g., using an unsubscribe message, and the BFIR clears the corresponding bit in the bit string.

The BIER network forwards multicast data packets through the BIER network based on the bit string. The BFIR transmits the bit string along with multicast data packets into the BIER network. There are number of different techniques available for transmitting the bit string. This description refers to encapsulating the bit string into the multicast data packet. This terminology covers not only incorporating the BM into the multicast data packet (e.g., as header or payload information), but also appending or prepending some or all of the bit string to the multicast data packet.

FIG. 3A is a flowchart that illustrates the operations discussed above. In one embodiment, the method is performed by a BFER, such BFR 214 of FIG. 2. At 302, the BFER requests BIER information, such as a bit position and set identifier. Requesting BIER information involves, in on embodiment, the BFER sending a message to a multicast domain controller, such as multicast domain controller 230 of FIG. 2. In one embodiment, the BIER information is automatically provided to the BFER in response to detecting the BFER has joined the network, or in response to some other condition. An administrator can manually configure the BFER with a BP and set identifier.

At 304, the BFER receives the BIER information, either as a result of administrative configuration, or, for example, included in a message from the MDC in response to the request for BIER information. At 306, in response to the BFER receiving the BIER information, the BFER advertises its BIER information and its router identifier, to some or all of the other nodes in the BIER network. In one embodiment, the BFER advertises its BP and SI via an interior gateway protocol (IGP). For example, Intermediate System to Intermediate System (ISIS) and/or Open Shortest Path First (OSPF) can be modified to assist in distributing this information through the BIER network using link state updates. Other flooding mechanisms to distribute the information are possible. All BFRs in a BIER network, not just the BFERs, also flood their router identifier, which is used in building network topology and unicast forwarding tables. BFRs, in one embodiment, advertise additional information as well, such as a bit string size that the BFR is configured to use. Adding such BIER information to the advertised information is a relatively small amount of additional information, as compared with the state information maintained on a per-group basis in traditional multicast.

FIG. 3B shows an example method of utilizing overlay signaling to distribute membership information in a BIER network. In one embodiment, the method of FIG. 3B is performed by a BFER, such as BFR 214 of FIG. 2.

At 322, the BFER receives a membership request from a host, such as host 203 of FIG. 2. The membership request is optionally relayed through a customer edge node, such as customer edge node 213 of FIG. 2. In one embodiment, the membership request comprises an IGMP message. The membership request includes information identifying a multicast group, and information identifying whether the host wishes to join, e.g. subscribe, or leave, e.g. unsubscribe from, the multicast group. In response to receiving the membership request, the BFER updates forwarding information indicating the host's membership in the multicast group. For example, if the membership request indicates that the host wishes to join multicast group G1, the BFER updates a forwarding entry such that any multicast data packets received by the BFER and addressed to multicast group G1 will be forwarded to the host by the BFER.

At 324, the BFER generates a membership message. The membership message signals the BFER's interest in the multicast group. The membership message carries information identifying the multicast group, and information identifying the BFER, such as the set identifier and bit position of the BFER. In one embodiment, the membership message is implemented using BGP.

At 326, the BFER transmits the membership message. In one embodiment, transmitting the membership message involves forwarding the membership message to a multicast domain controller, such as MDC 230 of FIG. 2. The MDC then transmits the membership message to some or all of the edge routers in the BIER domain, e.g., BFERs and BFIRs.

Bit Indexed Routing and Forwarding Tables

Each BFR in the BIER network uses the advertised BPs and router identifiers of the other BFRs to generate one or more bit indexed routing tables (BIRTs) and bit indexed forwarding tables (BIFTs). The BFRs use these tables to forward multicast data packets. A bit indexed routing table, as shown by example BIRT 262 of FIG. 2, is a table that stores BP-to-router identifier mappings, e.g., as learned via an interior gateway protocol (IGP). Each BFR receives BP-to-router identifier mappings and stores them in a BIRT. Using the router identifiers, a BFR performs a recursive lookup in unicast routing tables to identify a directly connected next hop BFR (referred to herein as a neighbor (NBR)) on the shortest path from the BFR toward the BFR associated with the BP. In one embodiment, the NBR is the next hop on a shortest path (SPT) towards the BFER that advertised the BP. In one embodiment, the BIRT includes one entry per BP.

Each BFR translates its BIRT(s) into one or more bit indexed forwarding tables (BIFTs). FIG. 2 illustrates an example BIFT 264 as generated by BFR B 208. Generating a BIFT involves, in one embodiment, first sorting the BIRT by neighbor. For entries in the BIRT that have a common NBR, the bit masks of those entries are OR′d together, creating a bit mask that is a combination of the BPs from those entries. This is referred to herein as a forwarding bit mask (FBM) or just bit mask (BM). Each bit that is set in the FBM indicates a BFER that is reachable via the neighbor associated with the FBM in the BIFT. Multicast data packets are forwarded by the BFRs using the BIFTs. For example, according to BIFT 264, if a multicast data packet having a bit string with BP {0001} set arrives at node 208, the multicast data packet should be forwarded to NBR C (BFR 210 in the example of FIG. 2). If a multicast data packet arrives at node 208 having a BP of {1000} set, the multicast data packet should be forwarded to NBR A (BFR 206 in the example of FIG. 2). If a multicast data packet arrives at node 208 having a bit string of {1001}, the multicast data packet should be forwarded to both NBR A and NBR C.

Packet Forwarding

After encapsulating the bit string into a multicast data packet, the BFIR forwards the multicast data packet to one or more BFRs using the BFIR's BFTS(s). A BFR that receives the multicast data packet determines, using the bit string in the multicast data packet and the BFR's own BFT(s), whether to forward the multicast data packet to one or more of its neighbors, and if so, to which one(s). To do so, the BFR compares the bit string in the multicast data packet with the FBM entries in the BFR's BFT. In one embodiment, the BFR performs a logical AND operation between the multicast data packet's bit string and the FBMs in the BFR's BFT. As noted, the BFR's BFT includes, in one embodiment, an entry for each neighbor of the BFR, and each entry includes a FBM field that indicates which BFERs are reachable along a shortest path via the neighbor identified in the entry. If the result of the AND is TRUE for a given neighbor, the BFR forwards the multicast data packet to that neighbor. A TRUE result indicates that an FBM for a given neighbor in the BFR's BIFT has one or more bits set to 1 and that a corresponding bit (or bits) in the multicast data packet's bit string is also set to 1. The set bits in the multicast data packet's bit string indicate which BFERs have expressed interest in the multicast group, and the set bit in the BFR's BIFT entry indicates that the BFER that has expressed interest is reachable via the neighbor indicated in the entry. A BFR forwards a multicast data packet that contains a bit string to all neighbors for which the bit-wise AND operation between the bit string in the multicast data packet and the FBMs in the BFR's BIFT is TRUE.

In the example of FIG. 2, BFR 214 (a BFER) signals to BFR 206 (a BFIR) that BFR 214 is interested in receiving packets associated with a given multicast group or flow. BFRs 216 and 218 likewise signal BFR 206 that BFRs 216 and 218 are interested in the same multicast group. The signaling is represented by the dashed lines shown in FIG. 2. BFR 206 updates an entry in group membership table 224 (or creates one if one does not already exist) for the multicast group and updates a bit string in the entry by setting bits corresponding to BFRs 214, 216, and 218. The bit string corresponding to the multicast group is {0111}.

BFR 206 is configured to receive a multicast data packet addressed to the multicast group or flow (e.g., from source 201 via CE node 211). BFR 206 uses the multicast group address and/or source address included in the multicast data packet to access its GMT and select a bit string associated with the multicast group. After selecting a bit string that corresponds to the multicast group from the GMT, BFR 206 encapsulates the bit string for that multicast group into the multicast data packet and identifies the neighbors to which the packet will be forwarded (e.g., using its BFT). In one embodiment, this involves performing an AND operation between the bit string and each entry in BFR 206's BIFT. In this example, there is only one entry in the BIFT and the entry corresponds to BFR 208. This means that the shortest path from BFR 206 to all three of the BFERs in network 200 runs through BFR 208. Since the result of the AND is TRUE for NBR B (BFR 208), BFR 206 forwards the multicast data packet to BFR 208. BFR 206 also modifies the bit string in the multicast data packet it forwards, as discussed below.

In response to receiving the multicast data packet, BFR 208 performs an AND between the bit string in the multicast data packet, {0111}, and each entry in its BIFT (shown at 264). The result for NBR C is TRUE so BFR 208 forwards the multicast data packet to BFR 210. BFR 208 also modifies the bit string in the multicast data packet it forwards by clearing bits corresponding to BFERs that are not reachable via a shortest path through the BFR to which the multicast data packet is being forwarded. In this example, since node E is not reachable via node C (the shortest path from node B to node E does not run through C), node B clears the bit corresponding to node E in the bit string that node B forwards to node C, Thus, node B forwards the multicast data packet to node C with the bit string {0011}. The result for NBR E is also TRUE, so BFR 208 replicates the multicast data packet and forwards the multicast data packet to BFR 216, which is a BFER. Node B updates the bit string and forwards the multicast data packet to node E with the bit string {0100}.

BFR 210, in response to receiving the multicast data packet, performs an AND between the bit string in the multicast data packet, {0011}, and each entry in its BIFT and forwards the multicast data packet to BFR 214 which is a BFER and BFR 218.

Packet Forwarding Optimization

The process of packet forwarding described above involves a BFR comparing the bit string in an incoming multicast data packet with each entry in the BFR's BIFT. Each entry in the BFR's BIFT corresponds to a neighbor, so if the number of neighbors is large, the number of comparisons the BFR performs also is large. Each comparison represents a burden on computing resources and takes time. Therefore, it is desirable to reduce the number of comparisons involved in forwarding a multicast data packet. An embodiment, described below with regard to FIGS. 4-9, involves optimizing the forwarding information maintained by BFRs in a BIER network. A BFR generates a BIFT that is indexed by bit position, rather than by neighbor. The BFR compares the bit string with BIFT entries that correspond to set bits in the bit string. In this embodiment, the maximum number of comparisons the BFR performs is limited by the length of the bit string.

FIG. 4 is a simplified block diagram illustrating certain components of an example network 400. BFRs 410 through 416 are BFRs configured as transit nodes. BFRs 420 through 428 are BFRs configured as BFERs, with bit positions assigned as shown. BFR 406 is a BFR that can be either a transit node or a BFIR. In one embodiment, the BFRs are coupled directly or indirectly to one or more hosts (not shown), e.g., via one or more customer edge nodes (not shown). Network 400 also includes, optionally, a multicast data controller (not shown).

FIG. 5A shows an example bit indexed routing table (BIRT) 502 generated by a BFR, such as node 406 of FIG. 4. BIRT 502 includes three columns. The first column includes information identifying a bit position and (optionally) set identifier for each BFER included in the BIER network (e.g., network 400 of FIG. 4). In one embodiment, the column also includes a BFR-ID, or virtual bit position. A virtual bit position can be implemented as an integer unique among the edge routers in a BIER network. The second column includes a routable address for each of the BFERs, such as a loopback or BFR prefix. The third column includes one or more entries for the neighbor or neighbors via which the BFER corresponding to the BFR prefix is reachable along a shortest path from the node.

FIG. 5B is an example bit indexed forwarding table (BIFT) 504 generated, for example, by a BFR, such as node 406 of FIG. 4. BIFT 504 is generated using the information in BIRT 502 of FIG. 5A. As shown, BIFT 504 includes a column for a forwarding bit mask (FBM). BIFT 504 also includes a column for neighbors. BIFT 504 indicates that each of the bit positions set in the FBM is reachable via the corresponding neighbor. For example, considering the first entry in BIFT 504, BFERs corresponding to bit positions 1, 2, and 3 are reachable via neighbor A. BIFT 504 is indexed by NBR. That is, there is an entry corresponding to each of the BFRs neighbors.

FIG. 5C is an example optimized bit indexed forwarding table (BIFT) 506 generated, for example, by a BFR, such as node 406 of FIG. 4. Optimized BIFT 506 is indexed by bit position. Optimized BIFT 506 includes an entry for each bit position in a BIER network. The entry includes information identifying the BP, a neighbor via which a BFER corresponding to the BP is reachable, and a forwarding bit mask that identifies all BFERs reachable via the neighbor. A BFR generates an optimized BIFT using the BFR's BIRT and/or the BFRs BIFT (e.g., the BFR can convert a non-optimized BIFT into an optimized BIFT).

FIG. 6 is a flow chart illustrating an example process for generating a bit indexed routing table (BIRT). In one embodiment, FIG. 6 is performed by a BFR, such as BFR 406 of FIG. 4.

At 602, the BFR receives an advertisement generated by a BFER. In one embodiment, the advertisement is received via IGP and includes information identifying a mapping between a routable address associated with the BFER, such as a router identifier, and a bit position and set identifier associated with the BFER. In response to receiving the advertisement, the BFR determines, at 604, the BFR ID and BP included in the advertisement. The BFR also determines the set identifier, if one is included in the advertisement.

At 606, the BFR accesses its stored topology information to determine the next hop neighbor along the shortest path towards the BFER that generated the advertisement. At 608, the BFR updates the BIRT. In one embodiment, this comprises adding an entry that includes information identifying the BFR ID and bit position of the BFER, as well as the neighbor via which the BFER is reachable.

FIG. 7 is a flow chart illustrating an example process of generating a BIFT employed by a node, according to the present description. In one embodiment, FIG. 7 is performed by a BFR, such as BFR 406 of FIG. 4. Performance of the process of FIG. 7 produces a BIFT that is indexed by neighbor.

At 702, the BFR selects a first entry in the BFR's BIRT. At 704, the BFR determines the neighbor and bit position associated with the entry. In one embodiment, the neighbor is identified by a BFR ID or prefix or other information. At 706, the BFR determines whether the BIFT already includes an entry for the neighbor. In the case of the first BIRT entry, there is not a BIFT entry corresponding to the neighbor identifying the BIRT entry. If there is no BIFT entry corresponding to the neighbor, the BFR creates a BIFT entry corresponding to the neighbor at 708. At 710, the BFR sets a bit in the FBM corresponding to the bit position identified in the BIRT entry. At 712, the BFR determines whether the BIRT includes additional entries. If so, the BFR selects the next BIRT entry at 714.

For example, considering BIRT 502 of Figure SA, at 702, the BFR selects the first entry in the BIRT. In the example of BIRT 502, the first entry corresponds to neighbor D. Next, the BFR determines, at 704, that the entry corresponds to BP 5. That is, node P, which has been assigned BP 5, is reachable from the BFR via node D. Next, the BFR creates an entry in its BIFT for neighbor D and sets the fifth bit in the FBM. FIG. 5B shows that the entry corresponding to neighbor D has bit 5 set. The BFR then proceeds iteratively, next selecting the entry for neighbor C corresponding to bit 4, and so on. After performing the method shown in FIG. 7, the BFR will have a BIFT that includes one entry for each of the BFR's neighbors and each entry will include a forwarding bit mask that has a bit set for each of the BFERs reachable that neighbor.

FIG. 8A is a flow chart illustrating an example process of generating a BIFT employed by a node, according to the present description. In one embodiment, FIG. 8A is performed by a BFR, such as BFR 406 of FIG. 4. FIG. 8A depicts a method of converting an existing non-optimized BIFT, as shown in FIG. 5B into an optimized BIFT, as shown in FIG. 5C.

At 804, the BFR selects the first BP in a bit string. In one embodiment, the bit string corresponds to a forwarding bit mask in the non-optimized BIFT. At 806, the BFR creates an entry corresponding to the selected BP in the optimized BIFT. In one embodiment, the entry includes a field for information identifying a neighbor via which a BFER corresponding to the BP is reachable and an FBM, which is initially blank, but which the BFR updates to include information identifying which bit positions are reachable via the neighbor.

At 810, the BFR selects the first entry in the non-optimized BIFT. At 812, the BFR determines whether the selected bit position includes a set bit in the FBM of the non-optimized BIFT. If not, the BFR determines, at 818, whether the non-optimized BIFT includes more entries. If so, the BFR selects the next entry in the non-optimized BIFT and determines if the selected bit position is set. This continues until either the non-optimized BIFT has been completely traversed or the BFR locates an entry that has the selected BP set.

In response to detecting an entry with the corresponding BP set, the BFR copies, at 814, information identifying the neighbor from the corresponding entry in the non-optimized BIFT to the entry in the optimized BIFT. The BFR also copies, at 816, the FBM from the entry in the non-optimized BIFT to the entry in the optimized BIFT. At 822, the BFR determines whether additional BPs remain in the bit string. If so, the BFR selects the next BP, at 824. The method continues until all BPs in the bit string have been processed.

Using the example of FIG. 5B, the BFR selects the first bit in the FBM (BP=1) and determines if the first bit is set in the first entry of BIFT 504, e.g., the entry corresponding to NBR A. Since BP=1 is not set in the entry corresponding to NBR A, the BFR selects the second entry, and then the third entry, which also do not include a set bit at BP=1. In response to determining that the fourth entry, corresponding to NBR D, has the first bit set, the BFR updates the entry in the optimized BIFT (e.g., BIFT 506 of FIG. 5C) to include the FBM and NBR information from the fourth entry of BIFT 504. BFR then selects the next bit in the bit string (BP=2) and repeats the process iteratively until all bits in the bit string have been processed.

FIG. 8B is a flow chart illustrating an example process of generating a BIFT employed by a node, according to the present description. In one embodiment, FIG. 8B is performed by a BFR, such as BFR 406 of FIG. 4. FIG. 8B depicts a method of generating an optimized BIFT, as shown, for example, in FIG. 5C, using information from the BFR's BIRT, as shown, for example, in FIG. 5A. In this embodiment, the optimized BIFT can be generated even if no existing BIFT is present.

At 850, the BFR selects the first BP in a bit string. At 852, the BFR creates an entry corresponding to the selected BP in the optimized BIFT. In one embodiment, the entry includes a field for information identifying a neighbor via which a BFER corresponding to the BP is reachable and an FBM, which is initially blank, but which the BFR updates to include information identifying which bit positions are reachable via the neighbor.

The BFR locates, at 854, an entry corresponding to the selected BP in the BIRT. At 856, the BFR determines the neighbor associated with the BP in the entry. The BFR updates, at 858, the neighbor field in the optimized BIFT entry corresponding to the BP. This indicates that the BP (e.g., the BFER assigned the BP) is reachable via the neighbor. The BFR also sets the bit corresponding to the BIRT entry, if the bit is not already set.

At 860, the BFR determines whether the BIRT includes additional entries that are associated with the neighbor. If so, the BFR selects the next entry and updates the optimized BIFT entry. In one embodiment, updating the BIFT entry involves setting the bit associated with the BIRT entry.

The BFR determines, at 864, whether additional bit positions remain in the bit string. If so, the BFR selects the next bit position in the bit string at 866. The method continues until all bit positions in the bit string are processed.

Using the example of BIRT 502, the BFR first selects BP=1 and locates an entry in BIRT 502 corresponding to BP=1. BIRT 502 indicates that BP=1 is reachable via node D. The BFR updates the entry corresponding to BP=1 with information identifying node D and setting the bit in BP=1. The BFR then determines if BIRT 502 includes any other entries corresponding to node D. The entry corresponding to BP=5 in BIRT 502 indicates that node D is the next hop via which the BFER corresponding to BP=5 is reachable. In response to determining that there is another entry corresponding to node D, the BFR updates the FBM corresponding to BP=1 in the optimized BIFT by setting the bit corresponding to BP=5.

FIG. 9 is a flow chart illustrating an example process of forwarding a multicast data packet employed by a node, according to the present description. In one embodiment, the process is performed by a BFR, such as BFR 406 of FIG. 4. The process of FIG. 9 can be performed using an optimized BIFT, such as optimized BIFT 506 of FIG. 5C.

At 902, the BFR receives a multicast data packet. The BFR determines, at 904, whether the multicast data packet is a BIER packet, and therefore includes a bit string. In one embodiment, the BFR scans the header of the multicast data packet for a value that indicates that the multicast data packet is a BIER packet. The BFR can detect that the sender of the multicast data packet was a BFR and therefore conclude that the multicast data packet is a BIER multicast data packet. If the multicast data packet is not a BIER multicast data packet, the BFR performs alternate processing at 906. In one embodiment, alternate processing 906 involves flooding the multicast data packet to all interfaces on the BFR, or dropping the multicast data packet. Alternatively, if traditional multicast forwarding information is available, the BFR can use that information to forward the packet.

If the multicast data packet is a BIER multicast data packet, the BFR knows that the multicast data packet includes a bit string. The BFR locates the bit string in the multicast data packet at 908. Using the bit string, the BFR determines which neighbors the multicast data packet should be forwarded to. In one embodiment, this involves selecting, as shown at 910, the first bit of the bit string and determining, as shown at 912, whether the first bit of the bit string is set. If the bit is not set, the BFR determines, at 922, whether more bits are present in the bit string. If so, the BFR selects the next bit at 924 and the method returns to 912.

In response to determining, at 912, that a bit in the bit string is set, the BFR selects, at 914, a forwarding entry with which to forward the multicast data packet. In one embodiment, the BFR selects a forwarding entry that corresponds to the bit position of the set bit in the bit string. At 916, the BFR creates a copy of the multicast data packet and updates the bit string in the copy of the multicast data packet. Updating the bit string in the copy of the multicast data packet involves clearing bits in the bit string that correspond to neighbors that are not reachable via a shortest path from the interface to which the copy of the packet is being forwarded. This can be accomplished by performing an AND operation between the bit string from the incoming multicast data packet and the bit mask in the forwarding table entry that corresponds to the selected bit. The resulting value is used as the bit string for the copy of the multicast data packet. At 918, the BFR forwards the multicast packet to the interface.

At 920, the BFR updates the bit string that arrived in the multicast data packet by clearing those bits in the multicast data packet's bit string that correspond to the bits which were set in the multicast data packet that the BFR forwarded. In one embodiment, this involves performing an AND operation between the bit string in the received multicast data packet, and the inverse of the bit mask in the entry corresponding to the selected bit. This has the effect of clearing those bits that correspond to bit positions which were set in the bit string of the outgoing packet, which prevents looping and duplication. The BFR then determines, at 922, whether more bits are present in the bit string. If so, the BFR selects the next bit at 924. The BFR continues to walk to the bit string of the received multicast data packet, bit-by-bit, until the end of the bit string is reached.

FIG. 10 is a block diagram illustrating certain additional and/or alternative components of nodes that can be employed, for example in the network shown in FIG. 3. In this depiction, node 1000 includes a number of line cards (line cards 1002(1)-(N)) that are communicatively coupled to a forwarding engine or packet forwarder 1010 and a processor 1020 via a data bus 1030 and a result bus 1040. Line cards 1002(1)-(N) include a number of port processors 1050(1,1)-(N,N) which are controlled by port processor controllers 1060(1)-(N). It will also be noted that forwarding engine 1010 and processor 1020 are not only coupled to one another via data bus 1030 and result bus 1040, but are also communicatively coupled to one another by a communications link 1070.

The processors 1050 and 1060 of each line card 1002 may be mounted on a single printed circuit board. When a packet or packet and header are received, the packet or packet and header may be identified and analyzed by router 1000 in the following manner Upon receipt, a packet (or some or all of its control information) or packet and header is sent from the one of port processors 1050(1,1)-(N,N) at which the packet or packet and header was received to one or more of those devices coupled to data bus 1030 (e.g., others of port processors 1050(1,1)-(N,N), forwarding engine 1010 and/or processor 1020). Handling of the packet or packet and header can be determined, for example, by forwarding engine 1010. For example, forwarding engine 1010 may determine that the packet or packet and header should be forwarded to one or more of port processors 1050(1,1)-(N,N). This can be accomplished by indicating to corresponding one(s) of port processor controllers 1060(1)-(N) that the copy of the packet or packet and header held in the given one(s) of port processors 1050(1,1)-(N,N) should be forwarded to the appropriate one of port processors 1050(1,1)-(N,N). In addition, or alternatively, once a packet or packet and header has been identified for processing, forwarding engine 1010, processor 1020 or the like can be used to process the packet or packet and header in some manner or add packet security information, in order to secure the packet. On a node sourcing such a packet or packet and header, this processing can include, for example, encryption of some or all of the packet's or packet and header's information, the addition of a digital signature or some other information or processing capable of securing the packet or packet and header. On a node receiving such a processed packet or packet and header, the corresponding process is performed to recover or validate the packet's or packet and header's information that has been thusly protected.

FIG. 11 is a block diagram of a computing device, illustrating how a forwarding module can be implemented in software, as described above. Computing system 1110 broadly represents any single or multi-processor computing device or system capable of executing computer-readable instructions. Examples of computing system 1110 include, without limitation, any one or more of a variety of devices including workstations, personal computers, laptops, client-side terminals, servers, distributed computing systems, handheld devices (e.g., personal digital assistants and mobile phones), network appliances, switches, routers, storage controllers (e.g., array controllers, tape drive controller, or hard drive controller), and the like. In its most basic configuration, computing system 1110 may include at least one processor 1114 and a system memory 1116. By executing the software that implements a forwarding module 1117, computing system 1110 becomes a special purpose computing device that is configured to perform packet forwarding, in the manner described above.

Processor 1114 generally represents any type or form of processing unit capable of processing data or interpreting and executing instructions. In certain embodiments, processor 1114 may receive instructions from a software application or module. These instructions may cause processor 1114 to perform the functions of one or more of the embodiments described and/or illustrated herein. For example, processor 1114 may perform and/or be a means for performing the operations described herein. Processor 1114 may also perform and/or be a means for performing any other operations, methods, or processes described and/or illustrated herein.

System memory 1116 generally represents any type or form of volatile or non-volatile storage device or medium capable of storing data and/or other computer-readable instructions. Examples of system memory 1116 include, without limitation, random access memory (RAM), read only memory (ROM), flash memory, or any other suitable memory device. Although not required, in certain embodiments computing system 1110 may include both a volatile memory unit (such as, for example, system memory 1116) and a non-volatile storage device (such as, for example, primary storage device 1132, as described in detail below). In one example, program instructions executable to implement a forwarding module configured to forward multicast data packets may be loaded into system memory 1116.

In certain embodiments, computing system 1110 may also include one or more components or elements in addition to processor 1114 and system memory 1116. For example, as illustrated in FIG. 11, computing system 1110 may include a memory controller 1118, an Input/Output (I/O) controller 1120, and a communication interface 1122, each of which may be interconnected via a communication infrastructure 1112.

Communication infrastructure 1112 generally represents any type or form of infrastructure capable of facilitating communication between one or more components of a computing device. Examples of communication infrastructure 1112 include, without limitation, a communication bus (such as an Industry Standard Architecture (ISA), Peripheral Component Interconnect (PCI), PCI express (PCIe), or similar bus) and a network.

Memory controller 1118 generally represents any type or form of device capable of handling memory or data or controlling communication between one or more components of computing system 1110. For example, in certain embodiments memory controller 1118 may control communication between processor 1114, system memory 1116, and I/O controller 1120 via communication infrastructure 1112. In certain embodiments, memory controller 1118 may perform and/or be a means for performing, either alone or in combination with other elements, one or more of the operations or features described and/or illustrated herein.

I/O controller 1120 generally represents any type or form of module capable of coordinating and/or controlling the input and output functions of a computing device. For example, in certain embodiments I/O controller 1120 may control or facilitate transfer of data between one or more elements of computing system 1110, such as processor 1114, system memory 1116, communication interface 1122, display adapter 1126, input interface 1130, and storage interface 1134.

Communication interface 1122 broadly represents any type or form of communication device or adapter capable of facilitating communication between computing system 1110 and one or more additional devices. For example, in certain embodiments communication interface 1122 may facilitate communication between computing system 1110 and a private or public network including additional computing systems. Examples of communication interface 1122 include, without limitation, a wired network interface (such as a network interface card), a wireless network interface (such as a wireless network interface card), a modem, and any other suitable interface. In at least one embodiment, communication interface 1122 may provide a direct connection to a remote server via a direct link to a network, such as the Internet. Communication interface 1122 may also indirectly provide such a connection through, for example, a local area network (such as an Ethernet network), a personal area network, a telephone or cable network, a cellular telephone connection, a satellite data connection, or any other suitable connection.

In certain embodiments, communication interface 1122 may also represent a host adapter configured to facilitate communication between computing system 1110 and one or more additional network or storage devices via an external bus or communications channel Examples of host adapters include, without limitation, Small Computer System Interface (SCSI) host adapters, Universal Serial Bus (USB) host adapters, Institute of Electrical and Electronics Engineers (IEEE) 11054 host adapters, Serial Advanced Technology Attachment (SATA) and external SATA (eSATA) host adapters, Advanced Technology Attachment (ATA) and Parallel ATA (PATA) host adapters, Fibre Channel interface adapters, Ethernet adapters, or the like.

Communication interface 1122 may also allow computing system 1110 to engage in distributed or remote computing. For example, communication interface 1122 may receive instructions from a remote device or send instructions to a remote device for execution.

As illustrated in FIG. 11, computing system 1110 may also include at least one display device 1124 coupled to communication infrastructure 1112 via a display adapter 1126. Display device 1124 generally represents any type or form of device capable of visually displaying information forwarded by display adapter 1126. Similarly, display adapter 1126 generally represents any type or form of device configured to forward graphics, text, and other data from communication infrastructure 1112 (or from a frame buffer) for display on display device 1124.

As illustrated in FIG. 11, computing system 1110 may also include at least one input device 1128 coupled to communication infrastructure 1112 via an input interface 1130. Input device 1128 generally represents any type or form of input device capable of providing input, either computer or human generated, to computing system 1110. Examples of input device 1128 include, without limitation, a keyboard, a pointing device, a speech recognition device, or any other input device.

As illustrated in FIG. 11, computing system 1110 may also include a primary storage device 1132 and a backup storage device 1133 coupled to communication infrastructure 1112 via a storage interface 1134. Storage devices 1132 and 1133 generally represent any type or form of storage device or medium capable of storing data and/or other computer-readable instructions. For example, storage devices 1132 and 1133 may be a magnetic disk drive (e.g., a so-called hard drive), a floppy disk drive, a magnetic tape drive, an optical disk drive, a flash drive, or the like. Storage interface 1134 generally represents any type or form of interface or device for transferring data between storage devices 1132 and 1133 and other components of computing system 1110. A storage device like primary storage device 1132 can store information such as routing tables and forwarding tables.

In certain embodiments, storage devices 1132 and 1133 may be configured to read from and/or write to a removable storage unit configured to store computer software, data, or other computer-readable information. Examples of suitable removable storage units include, without limitation, a floppy disk, a magnetic tape, an optical disk, a flash memory device, or the like. Storage devices 1132 and 1133 may also include other similar structures or devices for allowing computer software, data, or other computer-readable instructions to be loaded into computing system 1110. For example, storage devices 1132 and 1133 may be configured to read and write software, data, or other computer-readable information. Storage devices 1132 and 1133 may also be a part of computing system 1110 or may be a separate device accessed through other interface systems.

Many other devices or subsystems may be connected to computing system 1110. Conversely, all of the components and devices illustrated in FIG. 11 need not be present to practice the embodiments described and/or illustrated herein. The devices and subsystems referenced above may also be interconnected in different ways from that shown in FIG. 11.

Computing system 1110 may also employ any number of software, firmware, and/or hardware configurations. For example, one or more of the embodiments disclosed herein may be encoded as a computer program (also referred to as computer software, software applications, computer-readable instructions, or computer control logic) on a computer-readable storage medium. Examples of computer-readable storage media include magnetic-storage media (e.g., hard disk drives and floppy disks), optical-storage media (e.g., CD- or DVD-ROMs), electronic-storage media (e.g., solid-state drives and flash media), and the like. Such computer programs can also be transferred to computing system 1110 for storage in memory via a network such as the Internet or upon a carrier medium.

The computer-readable medium containing the computer program may be loaded into computing system 1110. All or a portion of the computer program stored on the computer-readable medium may then be stored in system memory 1116 and/or various portions of storage devices 1132 and 1133. When executed by processor 1114, a computer program loaded into computing system 1110 may cause processor 1114 to perform and/or be a means for performing the functions of one or more of the embodiments described and/or illustrated herein. Additionally or alternatively, one or more of the embodiments described and/or illustrated herein may be implemented in firmware and/or hardware. For example, computing system 1110 may be configured as an application specific integrated circuit (ASIC) adapted to implement one or more of the embodiments disclosed herein.

FIG. 12 is a block diagram of an exemplary network device that may be associated with a node in network 200 of FIG. 2. Network device 1250 of FIG. 12 may, for example, be associated with BIER-enabled node 206 in FIG. 2. In some cases “node” as used herein encompasses one or more network devices associated with the node. “Network devices” as used herein includes various devices, such as routers, switches, or network controllers that perform routing and/or forwarding functions and support one or more routing and/or switching protocols. A network device maintains one or more routing and/or forwarding tables that store routing and/or forwarding information identifying paths to various data sources and/or data consumers. In, for example, a multicast-enabled node, a network device implements a multicast routing protocol that is used to convey multicast data packets from a multicast source to a multicast receiver.

In the embodiment of FIG. 12, network device 1250 includes storage for membership information 1252, storage for forwarding information 1264, a forwarding module 1260, and an interface 1262. Interface 1262 is coupled to send and receive packets and/or other network messages. It is noted that network device 1250 may include additional interfaces, and that each interface can be a logical or physical interface. In one embodiment, interface 1262 includes one or more ports.

Forwarding module 1260 is configured to perform forwarding based on the stored forwarding information 1264. Forwarding module 1260 is also configured to update the stored membership information 1252 and forwarding information 1264. Forwarding module 1260 can implement one or more instances of a layer 3 protocol and/or a layer 2 protocol.

Entry 1270 provides an example of membership information stored in memory of a network device. As shown, entry 1270 includes a set identifier 1254, information 1256 identifying a bit position (BP), and information 1258 identifying a multicast group. The SI and BP identify a node with which entry 1270 is associated, and the multicast group information identifies a multicast group to which the corresponding node is subscribed. The storage for membership information 1252 is, in one embodiment, implemented as a group membership table.

Entry 1272 provides an example of forwarding information that can be stored in memory of a network device. As shown, entry 1272 includes information 1266 identifying a BP, a bit string or bit array 1268, and information 1269 identifying a neighbor. Forwarding module 1260 uses the information in entry 1272 to forward multicast data packets to the interface associated with the neighbor identified in the entry. The storage for forwarding information 1264 is, in one embodiment, implemented as a bit indexed forwarding table (BIFT).

Although the present invention has been described in connection with several embodiments, the invention is not intended to be limited to the specific forms set forth herein. On the contrary, it is intended to cover such alternatives, modifications, and equivalents as can be reasonably included within the scope of the invention as defined by the appended claims. 

What is claimed is:
 1. A method comprising: generating a bit-indexed forwarding table (BIFT) at a first network node of a network, wherein the BIFT comprises a plurality of entries, each entry of which corresponds to a bit position of a plurality of bit positions, each bit position of the plurality of bit positions represents an egress network node of a plurality of egress network nodes, and the generating configures the BIFT to be used in forwarding a packet to one or more of the plurality of egress network nodes, based at least in part on a bit string in the packet, and comprises selecting a bit position of the plurality of bit positions as a selected bit position, creating an entry of the plurality of entries, wherein the entry corresponds to the selected bit position, identifying a neighbor node associated with the selected bit position, and updating one or more fields of the entry with neighbor information regarding the neighbor node.
 2. The method of claim 1, further comprising: selecting another bit position of the plurality of bit positions as another selected bit position; creating another entry of the plurality of entries, wherein the another entry corresponds to the another selected bit position; identifying another neighbor node associated with the another selected bit position; and updating the one or more fields of the another entry with another neighbor information regarding the another neighbor node.
 3. The method of claim 1, further comprising: locating a bit-indexed routing table (BIRT) entry in a BIRT, wherein the BIRT entry is located based, at least in part, on the selected bit position; and reading the neighbor information from the BIRT entry.
 4. The method of claim 3, further comprising: identifying another neighbor node associated with the selected bit position, locating another BIRT entry in the BIRT, wherein the another BIRT entry is located based, at least in part, on the selected bit position; reading other neighbor information from the BIRT entry, wherein the other neighbor information is regarding the another neighbor node; and updating one or more fields of the entry with the other neighbor information.
 5. The method of claim 3, further comprising: receiving, at the first network node, an advertisement sent by an egress network node of the network, wherein the advertisement identifies the egress network node and a bit position, within a bit mask comprising bits in a plurality of bit positions, assigned to the egress network node; and generating or updating the BIRT, wherein the generating or updating comprises using information from the advertisement, and an entry of the bit routing table comprises an identifier of the egress network node, an identifier of the bit position assigned to the egress network node, and an identifier of an egress interface or neighbor node via which the egress network node is reachable from the first network node.
 6. The method of claim 5, further comprising: receiving, at the first network node, a data packet for transmission to one or more egress network nodes of the network, wherein the data packet comprises a multicast forwarding entry, the multicast forwarding entry comprises the bit mask, and each bit position of the plurality of bit positions corresponds to a single respective egress network node of the network; comparing the multicast forwarding entry with forwarding information stored in the BIFT; selecting at least one neighbor network node based on the comparing; generating an updated multicast forwarding by updating the multicast forwarding entry; and forwarding the data packet comprising the updated multicast forwarding entry to the at least one neighbor network node.
 7. The method of claim 6, wherein the multicast forwarding entry comprises a set identifier, and a value of the set identifier corresponds to a respective set of egress network nodes represented by the bit position of the plurality of bit positions.
 8. The method of claim 3, further comprising: obtaining, at a first egress network node of the plurality of egress network nodes, an assigned bit position of the plurality of bit positions, wherein the assigned bit position is assigned to the first egress network node; and sending an outgoing advertisement to one or more other network nodes in the network, wherein the outgoing advertisement identifies the first egress network node and the assigned bit position.
 9. The method of claim 8, wherein the obtaining the bit position comprises at least one of receiving the bit position from a controller of the network, or deriving the bit position from an identifier or address of the egress network node.
 10. The method of claim 8, further comprising receiving an incoming advertisement at the first egress network node, wherein the incoming advertisement was sent by an additional egress network node of the plurality of egress network nodes, the incoming advertisement identifies the additional egress network node and another assigned bit position, and the another assigned bit position is assigned to the additional egress network node.
 11. The method of claim 10, further comprising: generating or updating the BIRT, using information from the incoming advertisement, wherein the information comprises an identifier of the additional egress network node, an identifier of the another assigned bit position, and an identifier of an egress interface or a transit neighbor network node via which the additional egress network node is reachable from the first egress network node.
 12. The method of claim 1, further comprising: receiving, at the first network node, a membership request, wherein the membership request comprises information identifying a multicast group, and information identifying a plurality of egress routers; in response to the receiving the membership request, generating a membership message, wherein the membership message includes information identifying the multicast group and information identifying the first network node; and transmitting the membership message to a participant node of a plurality of participant nodes, wherein the participant node stores a bit string associated with the multicast group.
 13. The method of claim 12, wherein the transmitting is performed using at least one of border gateway protocol, in which case the membership message comprises a border gateway protocol message, or an interior gateway protocol.
 14. The method of claim 12, wherein the first network node comprises at least one of an area boundary router or a multicast domain controller.
 15. The method of claim 12, further comprising: receiving the membership message, wherein the plurality of egress routers comprises a second egress router, and the membership message was generated by the second egress router; identifying at least one bit position in the membership message that is associated with the second egress router, wherein identifying the at least one bit position comprises accessing the information identifying the plurality of egress routers, the information identifying the plurality of egress routers comprises a bit string, the bit string comprises a plurality of bits in the plurality of bit positions, and at least one bit position of the plurality of bit positions is associated with the second egress router; and recording membership of the second egress router in the multicast group, wherein the membership of the second egress router is recorded in a bit of a group membership table, and the bit corresponds to the at least one bit position identified in the membership message.
 16. The method of claim 15, wherein the membership message identifies a multicast group, and the multicast group comprises a plurality of transit network nodes of the network and the plurality of egress network nodes.
 17. A system comprising: one or more processors; and a computer-readable storage medium coupled to the one or more processors, comprising program instructions, which, when executed by the one or more processors, perform a method comprising generating a bit-indexed forwarding table (BIFT) at a first network node of a network, wherein the BIFT comprises a plurality of entries, each entry of which corresponds to a bit position of a plurality of bit positions, each bit position of the plurality of bit positions represents an egress network node of a plurality of egress network nodes, and the generating configures the BIFT to be used in forwarding a packet to one or more of the plurality of egress network nodes, based at least in part on a bit string in the packet, and comprises selecting a bit position of the plurality of bit positions as a selected bit position, creating an entry of the plurality of entries, wherein the entry corresponds to the selected bit position, identifying a neighbor node associated with the selected bit position, and updating one or more fields of the entry with neighbor information regarding the neighbor node.
 18. The system of claim 17, wherein the method further comprises: locating a bit-indexed routing table (BIRT) entry in a BIRT, wherein the BIRT entry is located based, at least in part, on the selected bit position; and reading the neighbor information from the BIRT entry.
 19. The system of claim 18, wherein the method further comprises: identifying another neighbor node associated with the selected bit position, locating another BIRT entry in the BIRT, wherein the another BIRT entry is located based, at least in part, on the selected bit position; reading other neighbor information from the BIRT entry, wherein the other neighbor information is regarding the another neighbor node; and updating one or more fields of the entry with the other neighbor information.
 20. A non-transitory computer-readable storage medium comprising program instructions, which, when executed by one or more processors of a computing system, perform a method comprising: generating a bit-indexed forwarding table (BIFT) at a first network node of a network, wherein the BIFT comprises a plurality of entries, each entry of which corresponds to a bit position of a plurality of bit positions, each bit position of the plurality of bit positions represents an egress network node of a plurality of egress network nodes, and the generating configures the BIFT to be used in forwarding a packet to one or more of the plurality of egress network nodes, based at least in part on a bit string in the packet, and comprises selecting a bit position of the plurality of bit positions as a selected bit position, creating an entry of the plurality of entries, wherein the entry corresponds to the selected bit position, identifying a neighbor node associated with the selected bit position, and updating one or more fields of the entry with neighbor information regarding the neighbor node. 